/* eslint-disable */
var r = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function(r) {
	return typeof r
} : function(r) {
	return r && "function" == typeof Symbol && r.constructor === Symbol && r !== Symbol.prototype ? "symbol" : typeof r
}


!function(t) {
	function e(r, t) {
		var e, n, i, o, s, u, f, c, h = r.constructor, d = h.precision
		if (!r.s || !t.s) return t.s || (t = new h(r)), E ? l(t, d) : t
		if (f = r.d, c = t.d, s = r.e, i = t.e, f = f.slice(), o = s - i) {
			for (o < 0 ? (n = f, o = -o, u = c.length) : (n = c, i = s, u = f.length), (u = u < (s = Math.ceil(d / q)) ? s + 1 : u + 1) < o && (o = u, 
			n.length = 1), n.reverse(); o--; ) n.push(0)
			n.reverse()
		}
		for ((u = f.length) - (o = c.length) < 0 && (o = u, n = c, c = f, f = n), e = 0; o; ) e = (f[--o] = f[o] + c[o] + e) / D | 0, 
		f[o] %= D
		for (e && (f.unshift(e), ++i), u = f.length; 0 == f[--u]; ) f.pop()
		return t.d = f, t.e = i, E ? l(t, d) : t
	}
	function n(r, t, e) {
		if (r !== ~~r || r < t || e < r) throw Error(b + r)
	}
	function i(r) {
		var t, e, n, i = r.length - 1, o = "", s = r[0]
		if (0 < i) {
			for (o += s, t = 1; t < i; t++) n = r[t] + "", (e = q - n.length) && (o += f(e)), 
			o += n
			s = r[t], (e = q - (n = s + "").length) && (o += f(e))
		} else if (0 === s) return "0"
		for (;s % 10 == 0; ) s /= 10
		return o + s
	}
	function o(r, t) {
		var e, n, o, u, f, c = 0, h = 0, d = r.constructor, a = d.precision
		if (16 < s(r)) throw Error(y + s(r))
		if (!r.s) return new d(v)
		for (null == t ? (E = !1, f = a) : f = t, u = new d(.03125); r.abs().gte(.1); ) r = r.times(u), 
		h += 5
		for (f += Math.log(O(2, h)) / Math.LN10 * 2 + 5 | 0, e = n = o = new d(v), d.precision = f; ;) {
			if (n = l(n.times(r), f), e = e.times(++c), i((u = o.plus(P(n, e, f))).d).slice(0, f) === i(o.d).slice(0, f)) {
				for (;h--; ) o = l(o.times(o), f)
				return d.precision = a, null == t ? (E = !0, l(o, a)) : o
			}
			o = u
		}
	}
	function s(r) {
		for (var t = r.e * q, e = r.d[0]; 10 <= e; e /= 10) t++
		return t
	}
	function u(r, t, e) {
		if (t > r.LN10.sd()) throw E = !0, e && (r.precision = e), Error(N + "LN10 precision limit exceeded")
		return l(new r(r.LN10), t)
	}
	function f(r) {
		for (var t = ""; r--; ) t += "0"
		return t
	}
	function c(r, t) {
		var e, n, o, f, h, d, a, g, p, w = 1, m = r, b = m.d, y = m.constructor, x = y.precision
		if (m.s < 1) throw Error(N + (m.s ? "NaN" : "-Infinity"))
		if (m.eq(v)) return new y(0)
		if (null == t ? (E = !1, g = x) : g = t, m.eq(10)) return null == t && (E = !0), 
		u(y, g)
		if (g += 10, y.precision = g, n = (e = i(b)).charAt(0), f = s(m), !(Math.abs(f) < 15e14)) return a = u(y, g + 2, x).times(f + ""), 
		m = c(new y(n + "." + e.slice(1)), g - 10).plus(a), y.precision = x, null == t ? (E = !0, 
		l(m, x)) : m
		for (;n < 7 && 1 != n || 1 == n && 3 < e.charAt(1); ) n = (e = i((m = m.times(r)).d)).charAt(0), 
		w++
		for (f = s(m), 1 < n ? (m = new y("0." + e), f++) : m = new y(n + "." + e.slice(1)), 
		d = h = m = P(m.minus(v), m.plus(v), g), p = l(m.times(m), g), o = 3; ;) {
			if (h = l(h.times(p), g), i((a = d.plus(P(h, new y(o), g))).d).slice(0, g) === i(d.d).slice(0, g)) return d = d.times(2), 
			0 !== f && (d = d.plus(u(y, g + 2, x).times(f + ""))), d = P(d, new y(w), g), y.precision = x, 
			null == t ? (E = !0, l(d, x)) : d
			d = a, o += 2
		}
	}
	function h(r, t) {
		var e, n, i
		for (-1 < (e = t.indexOf(".")) && (t = t.replace(".", "")), 0 < (n = t.search(/e/i)) ? (e < 0 && (e = n), 
		e += +t.slice(n + 1), t = t.substring(0, n)) : e < 0 && (e = t.length), n = 0; 48 === t.charCodeAt(n); ) ++n
		for (i = t.length; 48 === t.charCodeAt(i - 1); ) --i
		if (t = t.slice(n, i)) {
			if (i -= n, e = e - n - 1, r.e = x(e / q), r.d = [], n = (e + 1) % q, e < 0 && (n += q), 
			n < i) {
				for (n && r.d.push(+t.slice(0, n)), i -= q; n < i; ) r.d.push(+t.slice(n, n += q))
				t = t.slice(n), n = q - t.length
			} else n -= i
			for (;n--; ) t += "0"
			if (r.d.push(+t), E && (r.e > _ || r.e < -_)) throw Error(y + e)
		} else r.s = 0, r.e = 0, r.d = [ 0 ]
		return r
	}
	function l(r, t, e) {
		var n, i, o, u, f, c, h, l, d = r.d
		for (u = 1, o = d[0]; 10 <= o; o /= 10) u++
		if ((n = t - u) < 0) n += q, i = t, h = d[l = 0]; else {
			if (l = Math.ceil((n + 1) / q), (o = d.length) <= l) return r
			for (h = o = d[l], u = 1; 10 <= o; o /= 10) u++
			i = (n %= q) - q + u
		}
		if (void 0 !== e && (f = h / (o = O(10, u - i - 1)) % 10 | 0, c = t < 0 || void 0 !== d[l + 1] || h % o, 
		c = e < 4 ? (f || c) && (0 == e || e == (r.s < 0 ? 3 : 2)) : 5 < f || 5 == f && (4 == e || c || 6 == e && (0 < n ? 0 < i ? h / O(10, u - i) : 0 : d[l - 1]) % 10 & 1 || e == (r.s < 0 ? 8 : 7))), 
		t < 1 || !d[0]) return c ? (t = t - (o = s(r)) - (d.length = 1), d[0] = O(10, (q - t % q) % q), 
		r.e = x(-t / q) || 0) : (d.length = 1, d[0] = r.e = r.s = 0), r
		if (0 == n ? (d.length = l, o = 1, l--) : (d.length = l + 1, o = O(10, q - n), d[l] = 0 < i ? (h / O(10, u - i) % O(10, i) | 0) * o : 0), 
		c) for (;;) {
			if (0 == l) {
				(d[0] += o) == D && (d[0] = 1, ++r.e)
				break
			}
			if (d[l] += o, d[l] != D) break
			d[l--] = 0, o = 1
		}
		for (n = d.length; 0 === d[--n]; ) d.pop()
		if (E && (r.e > _ || r.e < -_)) throw Error(y + s(r))
		return r
	}
	function d(r, t) {
		var e, n, i, o, s, u, f, c, h, d, a = r.constructor, g = a.precision
		if (!r.s || !t.s) return t.s ? t.s = -t.s : t = new a(r), E ? l(t, g) : t
		if (f = r.d, d = t.d, n = t.e, c = r.e, f = f.slice(), s = c - n) {
			for ((h = s < 0) ? (e = f, s = -s, u = d.length) : (e = d, n = c, u = f.length), 
			(i = Math.max(Math.ceil(g / q), u) + 2) < s && (s = i, e.length = 1), e.reverse(), 
			i = s; i--; ) e.push(0)
			e.reverse()
		} else {
			for ((h = (i = f.length) < (u = d.length)) && (u = i), i = 0; i < u; i++) if (f[i] != d[i]) {
				h = f[i] < d[i]
				break
			}
			s = 0
		}
		for (h && (e = f, f = d, d = e, t.s = -t.s), u = f.length, i = d.length - u; 0 < i; --i) f[u++] = 0
		for (i = d.length; s < i; ) {
			if (f[--i] < d[i]) {
				for (o = i; o && 0 === f[--o]; ) f[o] = D - 1
				--f[o], f[i] += D
			}
			f[i] -= d[i]
		}
		for (;0 === f[--u]; ) f.pop()
		for (;0 === f[0]; f.shift()) --n
		return f[0] ? (t.d = f, t.e = n, E ? l(t, g) : t) : new a(0)
	}
	function a(r, t, e) {
		var n, o = s(r), u = i(r.d), c = u.length
		return t ? (e && 0 < (n = e - c) ? u = u.charAt(0) + "." + u.slice(1) + f(n) : 1 < c && (u = u.charAt(0) + "." + u.slice(1)), 
		u = u + (o < 0 ? "e" : "e+") + o) : o < 0 ? (u = "0." + f(-o - 1) + u, e && 0 < (n = e - c) && (u += f(n))) : c <= o ? (u += f(o + 1 - c), 
		e && 0 < (n = e - o - 1) && (u = u + "." + f(n))) : ((n = o + 1) < c && (u = u.slice(0, n) + "." + u.slice(n)), 
		e && 0 < (n = e - c) && (o + 1 === c && (u += "."), u += f(n))), r.s < 0 ? "-" + u : u
	}
	function g(r, t) {
		if (r.length > t) return r.length = t, !0
	}
	function p(t) {
		if (!t || "object" != (void 0 === t ? "undefined" : r(t))) throw Error(N + "Object expected")
		var e, n, i, o = [ "precision", 1, w, "rounding", 0, 8, "toExpNeg", -1 / 0, 0, "toExpPos", 0, 1 / 0 ]
		for (e = 0; e < o.length; e += 3) if (void 0 !== (i = t[n = o[e]])) {
			if (!(x(i) === i && o[e + 1] <= i && i <= o[e + 2])) throw Error(b + n + ": " + i)
			this[n] = i
		}
		if (void 0 !== (i = t[n = "LN10"])) {
			if (i != Math.LN10) throw Error(b + n + ": " + i)
			this[n] = new this(i)
		}
		return this
	}
	var v, w = 1e9, m = {
			precision: 20,
			rounding: 4,
			toExpNeg: -7,
			toExpPos: 21,
			LN10: "2.302585092994045684017991454684364207601101488628772976033327900967572609677352480235997205089598298341967784042286"
		}, E = !0, N = "[DecimalError] ", b = N + "Invalid argument: ", y = N + "Exponent out of range: ", x = Math.floor, O = Math.pow, L = /^(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i, D = 1e7, q = 7, M = 9007199254740991, _ = x(M / q), A = {}
	A.absoluteValue = A.abs = function() {
		var r = new this.constructor(this)
		return r.s && (r.s = 1), r
	}, A.comparedTo = A.cmp = function(r) {
		var t, e, n, i, o = this
		if (r = new o.constructor(r), o.s !== r.s) return o.s || -r.s
		if (o.e !== r.e) return o.e > r.e ^ o.s < 0 ? 1 : -1
		for (t = 0, e = (n = o.d.length) < (i = r.d.length) ? n : i; t < e; ++t) if (o.d[t] !== r.d[t]) return o.d[t] > r.d[t] ^ o.s < 0 ? 1 : -1
		return n === i ? 0 : i < n ^ o.s < 0 ? 1 : -1
	}, A.decimalPlaces = A.dp = function() {
		var r = this, t = r.d.length - 1, e = (t - r.e) * q
		if (t = r.d[t]) for (;t % 10 == 0; t /= 10) e--
		return e < 0 ? 0 : e
	}, A.dividedBy = A.div = function(r) {
		return P(this, new this.constructor(r))
	}, A.dividedToIntegerBy = A.idiv = function(r) {
		var t = this.constructor
		return l(P(this, new t(r), 0, 1), t.precision)
	}, A.equals = A.eq = function(r) {
		return !this.cmp(r)
	}, A.exponent = function() {
		return s(this)
	}, A.greaterThan = A.gt = function(r) {
		return 0 < this.cmp(r)
	}, A.greaterThanOrEqualTo = A.gte = function(r) {
		return 0 <= this.cmp(r)
	}, A.isInteger = A.isint = function() {
		return this.e > this.d.length - 2
	}, A.isNegative = A.isneg = function() {
		return this.s < 0
	}, A.isPositive = A.ispos = function() {
		return 0 < this.s
	}, A.isZero = function() {
		return 0 === this.s
	}, A.lessThan = A.lt = function(r) {
		return this.cmp(r) < 0
	}, A.lessThanOrEqualTo = A.lte = function(r) {
		return this.cmp(r) < 1
	}, A.logarithm = A.log = function(r) {
		var t, e = this, n = e.constructor, i = n.precision, o = i + 5
		if (void 0 === r) r = new n(10); else if ((r = new n(r)).s < 1 || r.eq(v)) throw Error(N + "NaN")
		if (e.s < 1) throw Error(N + (e.s ? "NaN" : "-Infinity"))
		return e.eq(v) ? new n(0) : (E = !1, t = P(c(e, o), c(r, o), o), E = !0, l(t, i))
	}, A.minus = A.sub = function(r) {
		return r = new this.constructor(r), this.s == r.s ? d(this, r) : e(this, (r.s = -r.s, 
		r))
	}, A.modulo = A.mod = function(r) {
		var t, e = this, n = e.constructor, i = n.precision
		if (!(r = new n(r)).s) throw Error(N + "NaN")
		return e.s ? (E = !1, t = P(e, r, 0, 1).times(r), E = !0, e.minus(t)) : l(new n(e), i)
	}, A.naturalExponential = A.exp = function() {
		return o(this)
	}, A.naturalLogarithm = A.ln = function() {
		return c(this)
	}, A.negated = A.neg = function() {
		var r = new this.constructor(this)
		return r.s = -r.s || 0, r
	}, A.plus = A.add = function(r) {
		return r = new this.constructor(r), this.s == r.s ? e(this, r) : d(this, (r.s = -r.s, 
		r))
	}, A.precision = A.sd = function(r) {
		var t, e, n
		if (void 0 !== r && r !== !!r && 1 !== r && 0 !== r) throw Error(b + r)
		if (t = s(this) + 1, e = (n = this.d.length - 1) * q + 1, n = this.d[n]) {
			for (;n % 10 == 0; n /= 10) e--
			for (n = this.d[0]; 10 <= n; n /= 10) e++
		}
		return r && e < t ? t : e
	}, A.squareRoot = A.sqrt = function() {
		var r, t, e, n, o, u, f, c = this, h = c.constructor
		if (c.s < 1) {
			if (!c.s) return new h(0)
			throw Error(N + "NaN")
		}
		for (r = s(c), E = !1, 0 == (o = Math.sqrt(+c)) || o == 1 / 0 ? (((t = i(c.d)).length + r) % 2 == 0 && (t += "0"), 
		o = Math.sqrt(t), r = x((r + 1) / 2) - (r < 0 || r % 2), n = new h(t = o == 1 / 0 ? "1e" + r : (t = o.toExponential()).slice(0, t.indexOf("e") + 1) + r)) : n = new h(o.toString()), 
		o = f = (e = h.precision) + 3; ;) if (n = (u = n).plus(P(c, u, f + 2)).times(.5), 
		i(u.d).slice(0, f) === (t = i(n.d)).slice(0, f)) {
			if (t = t.slice(f - 3, f + 1), o == f && "4999" == t) {
				if (l(u, e + 1, 0), u.times(u).eq(c)) {
					n = u
					break
				}
			} else if ("9999" != t) break
			f += 4
		}
		return E = !0, l(n, e)
	}, A.times = A.mul = function(r) {
		var t, e, n, i, o, s, u, f, c, h = this, d = h.constructor, a = h.d, g = (r = new d(r)).d
		if (!h.s || !r.s) return new d(0)
		for (r.s *= h.s, e = h.e + r.e, (f = a.length) < (c = g.length) && (o = a, a = g, 
		g = o, s = f, f = c, c = s), o = [], n = s = f + c; n--; ) o.push(0)
		for (n = c; 0 <= --n; ) {
			for (t = 0, i = f + n; n < i; ) u = o[i] + g[n] * a[i - n - 1] + t, o[i--] = u % D | 0, 
			t = u / D | 0
			o[i] = (o[i] + t) % D | 0
		}
		for (;!o[--s]; ) o.pop()
		return t ? ++e : o.shift(), r.d = o, r.e = e, E ? l(r, d.precision) : r
	}, A.toDecimalPlaces = A.todp = function(r, t) {
		var e = this, i = e.constructor
		return e = new i(e), void 0 === r ? e : (n(r, 0, w), void 0 === t ? t = i.rounding : n(t, 0, 8), 
		l(e, r + s(e) + 1, t))
	}, A.toExponential = function(r, t) {
		var e, i = this, o = i.constructor
		return void 0 === r ? e = a(i, !0) : (n(r, 0, w), void 0 === t ? t = o.rounding : n(t, 0, 8), 
		e = a(i = l(new o(i), r + 1, t), !0, r + 1)), e
	}, A.toFixed = function(r, t) {
		var e, i, o = this, u = o.constructor
		return void 0 === r ? a(o) : (n(r, 0, w), void 0 === t ? t = u.rounding : n(t, 0, 8), 
		e = a((i = l(new u(o), r + s(o) + 1, t)).abs(), !1, r + s(i) + 1), o.isneg() && !o.isZero() ? "-" + e : e)
	}, A.toInteger = A.toint = function() {
		var r = this.constructor
		return l(new r(this), s(this) + 1, r.rounding)
	}, A.toNumber = function() {
		return +this
	}, A.toPower = A.pow = function(r) {
		var t, e, n, i, s, u, f = this, h = f.constructor, d = +(r = new h(r))
		if (!r.s) return new h(v)
		if (!(f = new h(f)).s) {
			if (r.s < 1) throw Error(N + "Infinity")
			return f
		}
		if (f.eq(v)) return f
		if (n = h.precision, r.eq(v)) return l(f, n)
		if (t = r.e, u = (e = r.d.length - 1) <= t, s = f.s, u) {
			if ((e = d < 0 ? -d : d) <= M) {
				for (i = new h(v), t = Math.ceil(n / q + 4), E = !1; e % 2 && g((i = i.times(f)).d, t), 
				0 !== (e = x(e / 2)); ) g((f = f.times(f)).d, t)
				return E = !0, r.s < 0 ? new h(v).div(i) : l(i, n)
			}
		} else if (s < 0) throw Error(N + "NaN")
		return s = s < 0 && 1 & r.d[Math.max(t, e)] ? -1 : 1, f.s = 1, E = !1, i = r.times(c(f, n + 12)), 
		E = !0, (i = o(i)).s = s, i
	}, A.toPrecision = function(r, t) {
		var e, i, o = this, u = o.constructor
		return void 0 === r ? i = a(o, (e = s(o)) <= u.toExpNeg || e >= u.toExpPos) : (n(r, 1, w), 
		void 0 === t ? t = u.rounding : n(t, 0, 8), i = a(o = l(new u(o), r, t), r <= (e = s(o)) || e <= u.toExpNeg, r)), 
		i
	}, A.toSignificantDigits = A.tosd = function(r, t) {
		var e = this.constructor
		return void 0 === r ? (r = e.precision, t = e.rounding) : (n(r, 1, w), void 0 === t ? t = e.rounding : n(t, 0, 8)), 
		l(new e(this), r, t)
	}, A.toString = A.valueOf = A.val = A.toJSON = function() {
		var r = s(this), t = this.constructor
		return a(this, r <= t.toExpNeg || r >= t.toExpPos)
	}
	var P = function() {
		function r(r, t) {
			var e, n = 0, i = r.length
			for (r = r.slice(); i--; ) e = r[i] * t + n, r[i] = e % D | 0, n = e / D | 0
			return n && r.unshift(n), r
		}
		function t(r, t, e, n) {
			var i, o
			if (e != n) o = n < e ? 1 : -1; else for (i = o = 0; i < e; i++) if (r[i] != t[i]) {
				o = r[i] > t[i] ? 1 : -1
				break
			}
			return o
		}
		function e(r, t, e) {
			for (var n = 0; e--; ) r[e] -= n, n = r[e] < t[e] ? 1 : 0, r[e] = n * D + r[e] - t[e]
			for (;!r[0] && 1 < r.length; ) r.shift()
		}
		return function(n, i, o, u) {
			var f, c, h, d, a, g, p, v, w, m, E, b, y, x, O, L, M, _, A = n.constructor, P = n.s == i.s ? 1 : -1, R = n.d, U = i.d
			if (!n.s) return new A(n)
			if (!i.s) throw Error(N + "Division by zero")
			for (c = n.e - i.e, M = U.length, O = R.length, v = (p = new A(P)).d = [], h = 0; U[h] == (R[h] || 0); ) ++h
			if (U[h] > (R[h] || 0) && --c, (b = null == o ? o = A.precision : u ? o + (s(n) - s(i)) + 1 : o) < 0) return new A(0)
			if (b = b / q + 2 | 0, h = 0, 1 == M) for (U = U[d = 0], b++; (h < O || d) && b--; h++) y = d * D + (R[h] || 0), 
			v[h] = y / U | 0, d = y % U | 0; else {
				for (1 < (d = D / (U[0] + 1) | 0) && (U = r(U, d), R = r(R, d), M = U.length, O = R.length), 
				x = M, m = (w = R.slice(0, M)).length; m < M; ) w[m++] = 0
				for ((_ = U.slice()).unshift(0), L = U[0], U[1] >= D / 2 && ++L; d = 0, (f = t(U, w, M, m)) < 0 ? (E = w[0], 
				M != m && (E = E * D + (w[1] || 0)), 1 < (d = E / L | 0) ? (D <= d && (d = D - 1), 
				1 == (f = t(a = r(U, d), w, g = a.length, m = w.length)) && (d--, e(a, M < g ? _ : U, g))) : (0 == d && (f = d = 1), 
				a = U.slice()), (g = a.length) < m && a.unshift(0), e(w, a, m), -1 == f && (f = t(U, w, M, m = w.length)) < 1 && (d++, 
				e(w, M < m ? _ : U, m)), m = w.length) : 0 === f && (d++, w = [ 0 ]), v[h++] = d, 
				f && w[0] ? w[m++] = R[x] || 0 : (w = [ R[x] ], m = 1), (x++ < O || void 0 !== w[0]) && b--; ) ;
			}
			return v[0] || v.shift(), p.e = c, l(p, u ? o + s(p) + 1 : o)
		}
	}();
	(m = function r(t) {
		function e(r) {
			var t = this
			if (!(t instanceof e)) return new e(r)
			if (r instanceof (t.constructor = e)) return t.s = r.s, t.e = r.e, void (t.d = (r = r.d) ? r.slice() : r)
			if ("number" == typeof r) {
				if (0 * r != 0) throw Error(b + r)
				if (0 < r) t.s = 1; else {
					if (!(r < 0)) return t.s = 0, t.e = 0, void (t.d = [ 0 ])
					r = -r, t.s = -1
				}
				return r === ~~r && r < 1e7 ? (t.e = 0, void (t.d = [ r ])) : h(t, r.toString())
			}
			if ("string" != typeof r) throw Error(b + r)
			if (45 === r.charCodeAt(0) ? (r = r.slice(1), t.s = -1) : t.s = 1, !L.test(r)) throw Error(b + r)
			h(t, r)
		}
		var n, i, o
		if (e.prototype = A, e.ROUND_UP = 0, e.ROUND_DOWN = 1, e.ROUND_CEIL = 2, e.ROUND_FLOOR = 3, 
		e.ROUND_HALF_UP = 4, e.ROUND_HALF_DOWN = 5, e.ROUND_HALF_EVEN = 6, e.ROUND_HALF_CEIL = 7, 
		e.ROUND_HALF_FLOOR = 8, e.clone = r, e.config = e.set = p, void 0 === t && (t = {}), 
		t) for (o = [ "precision", "rounding", "toExpNeg", "toExpPos", "LN10" ], n = 0; n < o.length; ) t.hasOwnProperty(i = o[n++]) || (t[i] = this[i])
		return e.config(t), e
	}(m)).default = m.Decimal = m, v = new m(1), "function" == typeof define && define.amd ? define(function() {
		return m
	}) : (t || (t = "undefined" != typeof self && self && self.self == self ? self : Function("return this")()), 
	t.Decimal = m)
}(global)

function getSellPopular(coin) { // coin:金币
	let mapId = 1
	let trophyFormulaRoot = 0.38;
	let trophyFormulaDenominatorExp = 12;
	let trophyFormulaBase = [1401, 1370, 1330]; // 地图1取第一个，地图2取第二个
	let i = new Decimal("1e+" + trophyFormulaDenominatorExp);
	console.log(i.todp(0).toString())
	let e = new Decimal(coin);
	let val = new Decimal(trophyFormulaBase[mapId - 1]).times(e.div(i).pow(trophyFormulaRoot)).todp(0);
	return val;
}
console.log( getSellPopular(1e30).toString())
//地[1401, 1370, 1330][地图] *(金币/1e12)^0.38